A rejection sampling algorithm for off-centered discrete Gaussian distributions over the integers
نویسندگان
چکیده
منابع مشابه
On Rejection Sampling Algorithms for Centered Discrete Gaussian Distribution over Integers
Lattice-based cryptography has been accepted as a promising candidate for public key cryptography in the age of quantum computing. Discrete Gaussian sampling is one of fundamental operations in many lattice-based cryptosystems. In this paper, we discuss a sub-problem of discrete Gaussian sampling, which is to sample from a centered discrete Gaussian distribution DZ,σ,c over the integers Z with ...
متن کاملDiscrete Ziggurat: A Time-Memory Trade-Off for Sampling from a Gaussian Distribution over the Integers
Several lattice-based cryptosystems require to sample from a discrete Gaussian distribution over the integers. Existing methods to sample from such a distribution either need large amounts of memory or they are very slow. In this paper we explore a different method that allows for a flexible time-memory trade-off, offering developers freedom in choosing how much space they can spare to store pr...
متن کاملGaussian Sampling over the Integers: Efficient, Generic, Constant-Time
Sampling integers with Gaussian distribution is a fundamental problem that arises in almost every application of lattice cryptography, and it can be both time consuming and challenging to implement. Most previous work has focused on the optimization and implementation of integer Gaussian sampling in the context of specific applications, with fixed sets of parameters. We present new algorithms f...
متن کاملA Fast Euclidean Algorithm for Gaussian Integers
We present a new algorithm for computing a greatest common divisor of any two non-zero Gaussian integers. It is Euclidean in the sense that it computes a sequence of quotients and remainders. It is approximative in the sense that it approximates the exact quotient of any two successive remainders, Ai and Ai+1, and then uses a nearest Gaussian integer, Qi, to that approximate quotient to compute...
متن کاملDiscrete Adaptive Rejection Sampling
Adaptive rejection sampling (ARS) is an algorithm by Gilks and Wild for drawing samples from a continuous log-concave probability distribution with only black-box access to a function that computes the (unnormalized) density function. The ideas extend in a straightforward way to discrete log-concave distributions, but some details of the extension and its implementation can be tricky. This repo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Information Sciences
سال: 2018
ISSN: 1674-733X,1869-1919
DOI: 10.1007/s11432-017-9409-7